Experimental implementation of the quantum random-walk algorithm
نویسندگان
چکیده
Jiangfeng Du,* Hui Li, Xiaodong Xu, Mingjun Shi, Jihui Wu, Xianyi Zhou, and Rongdian Han Structure Research Laboratory and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, China 2 Department of Physics, Faculty of Science, National University of Singapore, Lower Kent Ridge, Singapore 119260, Republic of Singapore Harrison M. Randall Laboratory of Physics, The University of Michigan, Ann Arbor, Michigan 48109-1120 Laboratory of Structure of Biology, University of Science and Technology of China, Hefei 230027, People’s Republic of China ~Received 27 December 2002; published 22 April 2003!
منابع مشابه
Asymptotics of Quantum Random Walk Driven by Optical Cavity∗
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior expressed in the form of a limit probability distribution of a double horn shape. Questions of robustness and control of that limit distribution are addressed by...
متن کاملPhotons walking the line: a quantum walk with adjustable coin operations.
We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert space is increased. We observed a non-Gaussian distribution of the walker's final position, thus characterizing a faster spread of the photon wave packet in co...
متن کاملA Novel Clustering Algorithm Based on Quantum Random Walk
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one dimensional QRW. Then, the probability distributions on the positions induced by QRW in these algorithms are investigated, which also indicates the possibility of ob...
متن کاملEfficient circuits for quantum walks
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph’s method for preparing coherent versions of efficiently integrable probability distributions [2]. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measu...
متن کاملOptical implementation of one-dimensional quantum random walks using orbital angular momentum of a single photon
Photons can carry orbital angular momentum (OAM), which offers a practical realization of a high-dimensional quantum information carrier. In this paper, by employing OAM of a single photon, we propose an experimental scheme to implement one-dimensional two-state quantum random walks on an infinite line. Furthermore, we show that the scheme can be used to implement one-dimensional three-state qu...
متن کاملQuantum random walk search on satisfiability problems
Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003